Design of Packet-Based Block Codes with Shift Operators
نویسندگان
چکیده
منابع مشابه
Design of Packet-Based Block Codes with Shift Operators
This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of k information packets to construct r redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The cod...
متن کاملDesign of Multiple Descriptions with Symbol−based Turbo Codes over Noisy Channels with Packet Loss
Multiple descriptions (MD) with symbol−based turbo (SBT) codes are proposed, where the decoder exploits both non−uniformity of descriptions and their dependencies. A distortion−power adaptive system is obtained by setting an entropy constraint for quantizer design, which together with the MD index assignment (IA), control the level of redundancy at the MD source coder output. This is in turn ex...
متن کاملDesign of Mutiple Descriptions with Symbol-based Turbo Codes over Noisy Channels with Packet Loss
Multiple descriptions (MD) with symbol-based turbo (SBT) codes are proposed, where the decoder exploits both nonuniformity of descriptions and their dependencies. A distortion-power adaptive system is obtained by setting an entropy constraint for quantizer design, which together with the MD index assignment (IA), control the level of redundancy at the MD source coder output. This is in turn exp...
متن کاملSliding block codes between shift spaces over infinite alphabets
Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding block codes between Ott-Tomforde-Willis shift spaces and then we prove Curtis-Hedlund-Lyndon type theorems for them, finding sufficient and necessary conditions...
متن کاملBlock coset codes for M-ary phase shift keying
Aktract-Construction of efficient block-encoded M-ary phase shift keying (M-PSK) schemes is investigated in this paper. An algebraic approach is adopted in which the basic modulation signals are associated with the elements of a finite group. Using some of the properties of group partition chains, the algebraic properties of linear codes are investigated. From this analysis, a class of codes ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking
سال: 2010
ISSN: 1687-1499
DOI: 10.1155/2010/263210